Route optimization for multiple searchers

We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Expansion planning for waste‐to‐energy systems using waste forecast prediction sets

We consider an expansion planning problem for Waste‐to‐Energy (WtE) systems facing uncertainty in future waste supplies. The WtE expansion plans are regarded as strategic, long term decisions, while the waste distribution and treatment are medium to short term operational decisions which can adapt to the actual waste collected. We propose a prediction set uncertainty model which integrates a set of waste generation forecasts and is constructed based on user‐specified levels of forecasting errors. Next, we use the prediction sets for WtE expansion scenario analysis. More specifically, for a given WtE expansion plan, the guaranteed net present value (NPV) is evaluated by computing an extreme value forecast trajectory of future waste generation from the prediction set that minimizes the maximum NPV of the WtE project. This problem is essentially a multiple stage min‐max dynamic optimization problem. By exploiting the structure of the WtE problem, we show this is equivalent to a simpler min‐max optimization problem, which can be further transformed into a single mixed‐integer linear program. Furthermore, we extend the model to optimize the guaranteed NPV by searching over the set of all feasible expansion scenarios, and show that this can be solved by an exact cutting plane approach. We also propose a heuristic based on a constant proportion distribution rule for the WtE expansion optimization model, which reduces the problem into a moderate size mixed‐integer program. Finally, our computational studies demonstrate that our proposed expansion model solutions are very stable and competitive in performance compared to scenario tree approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 47–70, 2016     

Designing acceptance sampling schemes for life testing with mixed censoring

Mixed censoring is useful extension of Type I and Type II censoring and combines some advantages of both types of censoring. This paper proposes a general Bayesian framework for designing a variable acceptance sampling scheme with mixed censoring. A general loss function which includes the sampling cost, the time‐consuming cost, the salvage value, and the decision loss is employed to determine the Bayes risk and the corresponding optimal sampling plan. An explicit expression of the Bayes risk is derived. The new model can easily be adapted to create life testing models for different distributions. Specifically, two commonly used distributions including the exponential distribution and the Weibull distribution are considered with a special decision loss function. We demonstrate that the proposed model is superior to models with Type I or Type II censoring. Numerical examples are reported to illustrate the effectiveness of the method proposed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

基于跟踪-微分器的气浮十字梁复合控制研究

基于气浮十字梁实验系统的纵向模型,设计了基于跟踪-微分器的非线性PID控制律,加入补偿器克服跟踪-微分器产生的相位延迟,通过与普通PID控制律进行数学仿真和实物实验的比较,验证了所设计的控制算法鲁棒性好而且对噪声有良好的滤波作用,为深入探讨气动-质量矩复合控制奠定了基础。     

基于小波矩和支持向量机的装甲车辆识别研究

分析了应用小波矩特征进行地面复杂背景下装甲车辆识别的理论依据,实地采集了某型坦克和某型步兵战车的灰度图像,提取其小波矩特征,采用支持向量机进行分类识别,进行了性能测试实验。结果表明：归一化后的图像的小波矩特征具有良好的不变性;小波矩特征对噪声和局部遮挡有较强的适应性,识别率比较稳定;支持向量机方法具有良好的分类识别能力。     

任意张角水平对称天线的矩量法计算

以任意张角的水平对称天线为研究对象,应用矩量法对其进行计算,给出了利用矩量法求解天线问题的一般思路.基于Pocklington积分方程和Galerking法,采用分域积 Dirac函数展开及点匹配模式,计算得出此类天线的电流分布、输入阻抗和辐射方向图,并对不同张角和电长度的水平对称天线进行了比较,在实际使用中可根据不同通信要求对天线进行选择.     

Predictability of operational processes over finite horizon

Operational processes are usually studied in terms of stochastic processes. The main information measure used for predictability of stochastic processes is the entropy rate, which is asymptotic conditional entropy, thus not suitable for application over a finite horizon. We use the conditional entropy to study the predictability of stochastic processes over the finite horizon. It is well‐known that the conditional entropies of stationary processes decrease as the processes evolve, implying that, on average, their pasts become more informative about prediction of their future outcomes. Some important operational processes such as martingale, models for maintenance policies, nonhomogeneous Poisson, and mixed Poisson processes are nonstationary. We show that as a nonstationary process evolves, it may provide more information or less information about the future state of the system. We develop results for comparing the predictability of stochastic processes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous‐casting production

This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于分块的伪Zernike矩归一化的人脸识别方法

以改进的伪Zemike矩相关知识为背景,提出了一种新颖的人脸识别方法。该方法通过将人脸分块,降低了光照条件、人脸表情等外在因素对人脸识别的影响。首先将人脸图像分块并重组矩阵的行和列,然后计算重组后人脸图像的伪Zemike矩,并对其进行归一化处理,最后采用最小邻近分类器进行判别。实验结果表明,该方法对于人脸光照、姿态和表情变化均具有良好的鲁棒性。在前人的研究基础上,进一步探讨了伪Zemike矩在人脸识别方面的应用。     

低轨微小卫星姿态控制方案

针对轨道高度低于500km微小卫星姿态控制问题,从充分利用环境力矩的角度出发,提出一种主动磁控+气动稳定力矩的姿态控制方案.该方案较好地解决了局部稳定控制律的全局稳定问题.仿真结果表明:特征距离d∝是影响该控制方案的主要因素.d∝值越大,对控制越有利,但随着d∝值的增大,卫星总体设计难度也会加大,因此实际中应选择合适的...